package com.zyk.leetcode;

/**
 * @author zhangsan
 * @date 2021/5/30 15:38
 */
public class C395 {

    // 至少有 K 个重复字符的最长子串
    /*public static int longestSubstring(String s, int k) {

    }*/


    // for test
    public static void main(String[] args) {
        String s = "aaabb";
        int k = 3;
//        System.out.println(longestSubstring(s, k));
    }

}
